Exact dynamical state of the exclusive queueing process with deterministic hopping
نویسندگان
چکیده
منابع مشابه
Exclusive Queueing Process with Discrete Time
In a recent study [1], an extension of the M/M/1 queueing process with the excluded-volume effect as in the totally asymmetric simple exclusion process (TASEP) was introduced. In this paper, we consider its discrete-time version. The update scheme we take is the parallel one. A stationary-state solution is obtained in a slightly arranged matrix product form of the discrete-time open TASEP with ...
متن کاملThe State of Deterministic Thinking among Mothers of Autistic Children
Objectives: The purpose of the present study was to investigate the effectiveness of cognitive-behavior education on decreasing deterministic thinking in mothers of children with autism spectrum disorders. Methods: Participants were 24 mothers of autistic children who were referred to counseling centers of Tehran and their children’s disorder had been diagnosed at least by a psychiatrist and...
متن کاملQueueing analysis with tra c models based on deterministic dynamical systems
Measurements of communication tra c from a wide variety of sources have suggested that correlations persist in such sources over fairly long time scales This has called into question the use of traditional tra c models for the per formance analysis of such networks and has sparked an interest in studying novel kinds of tra c models In particular a suggestion has been made to build models based ...
متن کاملHopping on the Bethe lattice: Exact results for densities of states and dynamical mean-field theory
Martin Eckstein,1 Marcus Kollar,1 Krzysztof Byczuk,2 and Dieter Vollhardt1 1Theoretical Physics III, Center for Electronic Correlations and Magnetism, Institute for Physics, University of Augsburg, D-86135 Augsburg, Germany 2Institute of Theoretical Physics, Warsaw University, ul. Hoża 69, PL-00-681 Warszawa, Poland Received 29 September 2004; revised manuscript received 10 January 2005; publis...
متن کاملQueueing with redundant requests: exact analysis
Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However, there is no exact analysis of systems with redundancy. This paper presents the first exact analysis of systems with redundancy. We allow for any number of classes of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2011
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.84.051127